package org.nowcoder.leetcode.DP;

/**
 * Title  : 96. Unique Binary Search Trees
 * Source : https://leetcode.cn/problems/unique-binary-search-trees/description/
 * Author : XrazYang
 * Date   : 2023-12-26
 */

public class LeetCode_92 {
    public int numTrees(int n) {
        int[] dp = new int[n + 1];
        dp[0] = 1;
        dp[1] = 1;

        for (int i = 2; i <= n; i++) {
            for (int j = 1; j <= i; j++) {
                dp[i] += dp[j - 1] * dp[i - j];
            }
        }
        return dp[n];
    }
}
